Iterated elimination procedures

The Complexity of Iterated Strategy Elimination

If I have good reasons not to use a certain option in a strategic situation, or can safely assume that my opponent will not use some of his options, then the situation can be considered as equivalent to a simpler one, in which the respective options are not available. Through the elimination of some of this options, however, it could become possible to discard further options. The procedure des...

Clause Elimination Procedures for CNF Formulas

Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedures such as tautology, subsumption, and blocked clause elimination, we introduce novel elimination procedures based on hidden and asymmetric variants of these techniques. We analyze the resulting nine (including five ne...

The Parallel Complexity of Elimination Ordering Procedures

We prove that lexicographic breadthrst search is P-complete and that a variant of the parallel perfect elimination procedure of P. Klein [24] is powerful enough to compute a semi-perfect elimination ordering in sense of [23] if certain induced subgraphs are forbidden. We present an e cient parallel breadth rst search algorithm for all graphs which have no cycle of length greater four and no hou...

Model Elimination and Connection Tableau Procedures

Relative Strength of Strategy Elimination Procedures

We compare here the relative strength of four widely used procedures on finite strategic games: iterated elimination of weakly/strictly dominated strategies by a pure/mixed strategy. A complication is that none of these procedures is based on a monotonic operator. To deal with this problem we use ’global’ versions of these operators.